We introduce a distributed algorithm for clock synchronization in sensornetworks. Our algorithm assumes that nodes in the network only know theirimmediate neighborhoods and an upper bound on the network's diameter.Clock-synchronization messages are only sent as part of the communication,assumed reasonably frequent, that already takes place among nodes. Thealgorithm has the gradient property of [2], achieving an O(1) worst-case skewbetween the logical clocks of neighbors. As in the case of [3,8], thealgorithm's actions are such that no constant lower bound exists on the rate atwhich logical clocks progress in time, and for this reason the lower bound of[2,5] that forbids constant skew between neighbors does not apply.
展开▼
